Juxtaposing Catalan Permutation Classes with Monotone Ones

نویسندگان

  • Robert Brignall
  • Jakub Sliacan
چکیده

This talk describes a clean and unified way to enumerate all juxtaposition classes of the form “Av(abc) next to Av(xy)”, where abc is a permutation of length three and xy is a permutation of length two. The main tools are Dyck paths, decorated by sequences of points, and context free grammars, used afterwards to enumerate these decorated Dyck paths. Juxtapositions are a simple special case of permutation grid classes. Grid classes found application mainly as tools to study the structure of other permutation classes. In [11], Vatter used the structural insights that monotone grid classes offer to classify growth rates of small permutation classes. Apart from enumerating permutation classes, several other applications of grid classes exist, among them [2, 1, 7, 8, 10, 12].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalised Pattern Avoidance

Recently, Babson and Steingŕımsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We will consider pattern avoidance for such patterns, and give a complete solution for the number of permutations avoiding any single pattern of length three with exactly one adjacent pair of letters. For eight...

متن کامل

Characterising inflations of monotone grid classes of permutations

We characterise those permutation classes whose simple permutations are monotone griddable. This characterisation is obtained by identifying a set of nine substructures, at least one of which must occur in any simple permutation containing a long sum of 21s.

متن کامل

On Partial Well-Order for Monotone Grid Classes of Permutations

The permutation π of [n] = {1, 2, . . . , n} contains the permutation σ of [k] = {1, 2, . . . , k} (written σ ≤ π) if π has a subsequence of length k order isomorphic to σ. For example, π = 391867452 (written in list, or one-line notation) contains σ = 51342, as can be seen by considering the subsequence 91672 (= π(2), π(3), π(5), π(6), π(9)). A permutation class is a downset of permutations un...

متن کامل

2×2 Monotone Grid Classes Are Finitely Based

In recent years, the emerging theory of grid classes has led to some of the major structural and enumerative developments in the study of permutation patterns. Particular highlights include the characterisation of all possible “small” growth rates (Huczynska and Vatter, 2006; Kaiser and Klazar, 2003; Vatter, 2011) and the subsequent result that all classes with these growth rates have rational ...

متن کامل

Expected Patterns in Permutation Classes

Each length k pattern occurs equally often in the set Sn of all permutations of length n, but the same is not true in general for a proper subset of Sn. Miklós Bóna recently proved that if we consider the set of n-permutations avoiding the pattern 132, all other non-monotone patterns of length 3 are equally common. In this paper we focus on the set Avn(123) of n-permutations avoiding 123, and g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2017